Intertemporal Pricing Under Minimax Regret

نویسندگان

  • René Caldentey
  • Ying Liu
  • Ilan Lobel
چکیده

We consider the pricing problem faced by a monopolist who sells a product to a population of consumers over a finite time horizon. Customers are heterogeneous along two dimensions: (i) willingness-to-pay for the product and (ii) arrival time during the selling season. We assume that the seller knows only the support of the customers’ valuations and do not make any other distributional assumptions about customers’ willingness-to-pay or arrival times. We consider a robust formulation of the seller’s pricing problem which is based on the minimization of her worst-case regret, a framework first proposed by Bergemann and Schlag (2008) in the context of static pricing. We consider two distinct cases of customers’ purchasing behavior: myopic and strategic customers. For both of these cases, we characterize optimal price paths. For myopic customers, the regret is determined by the price at a critical time. Depending on the problem parameters, this critical time will be either the end of the selling season or it will be a time that equalizes the worstcase regret generated by undercharging customers and the worst-case regret generated by customers waiting for the price to fall. The optimal pricing strategy is not unique except at the critical time. For strategic consumers, we develop a robust mechanism design approach to compute an optimal policy. Depending on the problem parameters, the optimal policy might lead some consumers to wait until the end of the selling season and might price others out of the market. Under strategic customers, the optimal price equalizes the regrets generated by different customer types that arrive at the beginning of the selling season. We show that a seller that does not know if the customers are myopic should price as if they are strategic. We also show there is no benefit under myopic consumers to having a selling season longer than a certain uniform bound, but that the same is not true with strategic consumers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust monopoly pricing

We consider a robust version of the classic problem of optimal monopoly pricing with incomplete information. In the robust version, the seller faces model uncertainty and only knows that the true demand distribution is in the neighborhood of a given model distribution. We characterize the pricing policies under two distinct decision criteria with multiple priors: (i) maximin utility and (ii) mi...

متن کامل

An adaptive algorithm for finite stochastic partial monitoring

We present a new anytime algorithm that achieves near-optimal regret for any instance of finite stochastic partial monitoring. In particular, the new algorithm achieves the minimax regret, within logarithmic factors, for both “easy” and “hard” problems. For easy problems, it additionally achieves logarithmic individual regret. Most importantly, the algorithm is adaptive in the sense that if the...

متن کامل

Robustness in portfolio optimization based on minimax regret approach

Portfolio optimization is one of the most important issues for effective and economic investment. There is plenty of research in the literature addressing this issue. Most of these pieces of research attempt to make the Markowitz’s primary portfolio selection model more realistic or seek to solve the model for obtaining fairly optimum portfolios. An efficient frontier in the ...

متن کامل

Multi-attribute Regret-based Dynamic Pricing

In this paper, we consider the problem of dynamic pricing by a set of competing sellers in an information economy where buyers differentiate products along multiple attributes, and buyer preferences can change temporally. Previous research in this area has either focused on dynamic pricing along a limited number of (e.g. binary) attributes, or, assumes that each seller has access to private inf...

متن کامل

Minimax regret and strategic uncertainty

This paper introduces a new solution concept, a minimax regret equilibrium, which allows for the possibility that players are uncertain about the rationality and conjectures of their opponents. We provide several applications of our concept. In particular, we consider pricesetting environments and show that optimal pricing policy follows a non-degenerate distribution. The induced price dispersi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Operations Research

دوره 65  شماره 

صفحات  -

تاریخ انتشار 2017